Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
h2(x, c2(y, z)) -> h2(c2(s1(y), x), z)
h2(c2(s1(x), c2(s1(0), y)), z) -> h2(y, c2(s1(0), c2(x, z)))
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
h2(x, c2(y, z)) -> h2(c2(s1(y), x), z)
h2(c2(s1(x), c2(s1(0), y)), z) -> h2(y, c2(s1(0), c2(x, z)))
Q is empty.
Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
H2(c2(s1(x), c2(s1(0), y)), z) -> H2(y, c2(s1(0), c2(x, z)))
H2(x, c2(y, z)) -> H2(c2(s1(y), x), z)
The TRS R consists of the following rules:
h2(x, c2(y, z)) -> h2(c2(s1(y), x), z)
h2(c2(s1(x), c2(s1(0), y)), z) -> h2(y, c2(s1(0), c2(x, z)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
H2(c2(s1(x), c2(s1(0), y)), z) -> H2(y, c2(s1(0), c2(x, z)))
H2(x, c2(y, z)) -> H2(c2(s1(y), x), z)
The TRS R consists of the following rules:
h2(x, c2(y, z)) -> h2(c2(s1(y), x), z)
h2(c2(s1(x), c2(s1(0), y)), z) -> h2(y, c2(s1(0), c2(x, z)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.